Loop scheduling for minimizing schedule length and switching activities
نویسندگان
چکیده
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activities for applications with loops. We show that to find a schedule that has the minimal switching activities among all minimum-latency schedules with or without resource constraints is NP-complete. Although the minimum latency scheduling problem is polynomial-time solvable if there is no resource constraints or only one function unit, the problem becomes NP-complete when considering switching activities as the second constraint. An algorithm, Power Reduction Rotation Scheduling (PRRS), is proposed. The algorithm attempts to minimize both switching activities and schedule length while performing scheduling and allocation simultaneously. The experimental results show that our algorithm produces effective schedules that give the switching activities 58.5% less compared to the traditional rotation scheduling on average. Our algorithm also shows better performance than the approach that considers scheduling and allocation at the separate phases.
منابع مشابه
Switching-Activity Minimization on Instruction-Level Loop Scheduling for VLIWDSP Applications
This paper develops an instruction-level loop scheduling technique to reduce both execution time and bus switching activities for applications with loops on VLIW architectures. We propose an algorithm, SAMLS (Switching-Activity Minimization Loop Scheduling), to minimize both schedule length and switching activities for applications with loops. In the algorithm, we obtain the best schedule from ...
متن کاملAlgorithms and analysis of scheduling for loops with minimum switching
Switching activity and schedule length are the two of the most important factors in power dissipation. This paper studies the scheduling problem that minimises both schedule length and switching activities for applications with loops on multiple functional unit architectures. We show that, to find a schedule that has the minimal switching activities among all minimum latency schedules with or w...
متن کاملA Mathematical Model for Scheduling Elective Surgeries for Minimizing the Waiting Times in Emergency Surgeries
The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that...
متن کاملLoop Scheduling for Real-Time DSPs with Minimum Switching Activities on Multiple-Functional-Unit Architectures
متن کامل
Public transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کامل